翻訳と辞書
Words near each other
・ Circulaire
・ Circulant graph
・ Circulant matrix
・ Circular
・ Circular (album)
・ Circular (application)
・ Circular 10/65
・ Circular 10/70
・ Circular 230
・ Circular algebraic curve
・ Circular analysis
・ Circular arc hull
・ Circular bacterial chromosome
・ Circular Breathing
・ Circular breathing
Circular buffer
・ Circular chess
・ Circular coloring
・ Circular Congregational Church
・ Circular connector
・ Circular convolution
・ Circular cumulative causation
・ Circular definition
・ Circular delivery company
・ Circular dependency
・ Circular dichroism
・ Circular distribution
・ Circular DNA
・ Circular economy
・ Circular Electron Positron Collider


Dictionary Lists
翻訳と辞書 辞書検索 [ 開発暫定版 ]
スポンサード リンク

Circular buffer : ウィキペディア英語版
Circular buffer

A circular buffer, circular queue, cyclic buffer or ring buffer is a data structure that uses a single, fixed-size buffer as if it were connected end-to-end.
This structure lends itself easily to buffering data streams.
==Uses==
The useful property of a circular buffer is that it does not need to have its elements shuffled around when one is consumed.
(If a non-circular buffer were used then it would be necessary to shift all elements when one is consumed.)
In other words, the circular buffer is well-suited as a FIFO buffer while a standard, non-circular buffer is well suited as a LIFO buffer.
Circular buffering makes a good implementation strategy for a queue that has fixed maximum size. Should a maximum size be adopted for a queue, then a circular buffer is a completely ideal implementation; all queue operations are constant time. However, expanding a circular buffer requires shifting memory, which is comparatively costly. For arbitrarily expanding queues, a linked list approach may be preferred instead.
In some situations, overwriting circular buffer can be used, e.g. in multimedia. If the buffer is used as the bounded buffer in the producer-consumer problem then it is probably desired for the producer (e.g., an audio generator) to overwrite old data if the consumer (e.g., the sound card) is unable to momentarily keep up. Also, the LZ77 family of lossless data compression algorithms operates on the assumption that strings seen more recently in a data stream are more likely to occur soon in the stream. Implementations store the most recent data in a circular buffer.

抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)
ウィキペディアで「Circular buffer」の詳細全文を読む



スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース

Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.